Horizon matching for localizing unordered panoramic images

نویسندگان

  • Damien Michel
  • Antonis A. Argyros
  • Manolis I. A. Lourakis
چکیده

There is currently an abundance of vision algorithms which, provided with a sequence of images that have been acquired from sufficiently close successive 3D locations, are capable of determining the relative positions of the viewpoints from which the images have been captured. However, very few of these algorithms can cope with unordered image sets. This paper presents an efficient method for recovering the position and orientation parameters corresponding to the viewpoints of a set of panoramic images for which no a priori order information is available, along with certain structure information regarding the imaged environment. The proposed approach assumes that all images have been acquired from a constant height above a planar ground and operates sequentially, employing the Levenshtein distance to deduce the spatial proximity of image viewpoints and thus determine the order in which images should be processed. The Levenshtein distance also provides matches between imaged points, from which their corresponding environment points can be reconstructed. Image matching with the aid of the Levenshtein distance forms the crux of an iterative process that alternates between image localization from multiple reconstructed points and point reconstruction from multiple image projections, until all views have been localized. Periodic refinement of the reconstruction with the aid of bundle adjustment, distributes the reconstruction error among images. The approach is demonstrated on several unordered sets of panoramic images obtained in indoor environments. 2009 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Panoramic Horizon Recognition

This paper describes a method in which SIFT features on and around the horizon are used for image classification (matching or recognition). Ordinarily, transformational geometry relating two images is recovered from a set of point correspondances – but correspondance formation may be improved and accelerated using geometric constraints. The proposed solution to this chicken/egg problem is to fi...

متن کامل

Graph-based multiple panorama extraction from unordered image sets

This paper presents a multi-image registration method, which aims at recognizing and extracting multiple panoramas from an unordered set of images without user input. A method for panorama recognition introduced by Lowe and Brown [1] is based on extraction of a full set of scale invariant image features and fast matching in feature space, followed by post-processing procedures. We propose a dif...

متن کامل

A New Point Matching Algorithm for Panoramic Reflectance Images

Much attention is paid to registration of terrestrial point clouds nowadays. Research is carried out towards improved efficiency and automation of the registration process. The most important part of registration is finding correspondence. The panoramic reflectance images are generated according to the angular coordinates and reflectance value of each 3D point of 360° full scans. Since it is si...

متن کامل

Dynamic mutual calibration and view planning for cooperative mobile robots with panoramic virtual stereo vision

This paper presents a panoramic virtual stereo vision approach to the problem of detecting and localizing multiple moving objects (e.g., humans) in an indoor scene. Two panoramic cameras, residing on different mobile platforms, compose a virtual stereo sensor with a flexible baseline. A novel ‘‘mutual calibration’’ algorithm is proposed, where panoramic cameras on two cooperative moving platfor...

متن کامل

Hierarchical matching of panoramic images

When matching regions from “similar” images, one typically has the problem of missing counterparts due to local or even global variations of segmentation fineness. Matching segmentation hierarchies, however, not only increases the chances of finding counterparts, but also allows us to exploit the manifold constraints coming from the topological relations between the regions in a hierarchy. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Vision and Image Understanding

دوره 114  شماره 

صفحات  -

تاریخ انتشار 2010